One Way Function Candidate based on the Collatz Problem
نویسنده
چکیده
The one way function based on Collatz problem is proposed. While Colatz (3x + 1) problem is well known and undecided, the proposal is actually based on the problem’s underlying conditional branching structure. The analysis shows why the 3x + 1 problem is so difficult and how the algorithm conditional branching structure can be used to construct an one way function.
منابع مشابه
Some Natural Generalizations Of The Collatz Problem∗
We define here simple natural generalizations of Collatz Problem, stating some corresponding conjectures and showing some first interesting computations. We also address the conceptual importance of this kind of problems and the expected diffi culties into solving them. 1 Why Generalize an Apparently Intractable Problem? The Collatz Conjecture or 3x + 1 Conjecture, an elusive two-line algorithm...
متن کاملA NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA
In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...
متن کاملA cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling
Make-to-order is a production strategy in which manufacturing starts only after a customer's order is received; in other words, it is a pull-type supply chain operation since manufacturing is carried out as soon as the demand is confirmed. This paper studies the order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling with MTO production strategy, the objec...
متن کاملMore Jabber about the Collatz Conjecture and a Closed Form for Detecting Cycles on Special Subsequences [Assertion: Collatz cycles]
In [ref 1] apparently published in 2006 professor Cadogan presents an interesting function that maps natural numbers into a two dimensional array based on how many ones the number trails off with. The length of trailing one's is said to be the row index. The rest of the number, divided by 2, is the column index. He then shows that applying the Collatz function reduces the ending string of ones ...
متن کاملStructural Properties and Complexity of a New Network Class: Collatz Step Graphs
In this paper, we introduce a biologically inspired model to generate complex networks. In contrast to many other construction procedures for growing networks introduced so far, our method generates networks from one-dimensional symbol sequences that are related to the so called Collatz problem from number theory. The major purpose of the present paper is, first, to derive a symbol sequence fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1801.05079 شماره
صفحات -
تاریخ انتشار 2018